منابع مشابه
Subnormal Embedding Theorems for Groups
In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations of theorems of P. Hall, R. Dark, B. Neumann, Hanna Neumann, G. Higman on embeddings of that type. Considering subnormal embeddings of finite groups into fin...
متن کاملSmall cancellations over relatively hyperbolic groups and embedding theorems
In this paper we generalize the small cancellation theory over hyperbolic groups developed by Olshanskii to the case of relatively hyperbolic groups. This allows us to construct infinite finitely generated groups with exactly n conjugacy classes for every n ≥ 2. In particular, we give the affirmative answer to the well–known question of the existence of a finitely generated group G other than Z...
متن کاملCoding Theorems for Reversible Embedding
We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...
متن کاملOn Some Embedding Theorems for Inverse Semigroups
A semilattice decomposition of an inverse semigroup has good internal mapping properties. These are used to give natural proofs of some embedding theorems, which were originally proved in a rather artificial way. The reader is referred to [1] for the basic theory of inverse semigroups. In an earlier paper [3] we proved the following embedding result: (1) An E-unitary inverse semigroup is isomor...
متن کاملTwo Embedding Theorems for Finite Lattices
Introduction. One of the important unsolved problems of lattice theory is the problem of embedding every finite lattice in a finite partition lattice. The partition lattice can be considered as the lattice of subspaces of a suitable geometry. By slightly loosening the conditions on this geometry it will be shown that every finite lattice can be embedded in the lattice of subspaces of a finite g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 1949
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-24.4.247